Quasi-Newton updates with weighted secant equations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi-Newton updates with weighted secant equations

We provide a formula for variational quasi-Newton updates with multiple weighted secant equations. The derivation of the formula leads to a Sylvester equation in the correction matrix. Examples are given.

متن کامل

Newton - Secant method for solving operator equations ∗

where F is a Fréchet-differentiable operator defined on an open subset D of a Banach space X with values in a Banach space Y . Finding roots of Eq.(1) is a classical problem arising in many areas of applied mathematics and engineering. In this study we are concerned with the problem of approximating a locally unique solution α of Eq.(1). Some of the well known methods for this purpose are the f...

متن کامل

Incorporating Function Values into Quasi-Newton Updates

The traditional quasi-Newton method for updating the approximate Hessian is based on the change in the gradient of the objective function. This paper describes a new update method that incorporates also the change in the value of the function. The method effectively uses a cubic approximation of the objective function to better approximate its directional second derivative. The cubic approximat...

متن کامل

Low complexity secant quasi-Newton minimization algorithms for nonconvex functions

In this work some interesting relations between results on basic optimization and algorithms for nonconvex functions (such as BFGS and secant methods) are pointed out. In particular, some innovative tools for improving our recent secant BFGS-type and LQN algorithms are described in detail. © 2006 Elsevier B.V. All rights reserved. MSC: 51M04; 65H20; 65F30; 90C53

متن کامل

Least-change quasi-Newton updates for equality-constrained optimization

January 28, 2000 Abstract. This paper investigates quasi-Newton updates for equality-constrained optimization. Using a least-change argument we derive a class of rank-3 updates to approximations of the one-sided projection of the Hessian of the Lagrangian which keeps the appropriate part symmetric (and possibly positive definite). By imposing the usual assumptions we are able to prove 1-step su...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Optimization Methods and Software

سال: 2014

ISSN: 1055-6788,1029-4937

DOI: 10.1080/10556788.2014.971025